Deterministic function computation with chemical reaction networks
نویسندگان
چکیده
منابع مشابه
Probability 1 computation with chemical reaction networks ∗ Rachel Cummings
The computational power of stochastic chemical reaction networks (CRNs) varies significantly with the output convention and whether or not error is permitted. Focusing on probability 1 computation, we demonstrate a striking difference between stable computation that converges to a state where the output cannot change, and the notion of limit-stable computation where the output eventually stops ...
متن کاملStructural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics
We study the structural simplification of chemical reaction networks preserving the deterministic kinetics. We aim at finding simplification rules that can eliminate intermediate molecules while preserving the dynamics of all others. The rules should be valid even though the network is plugged into a bigger context. An example is Michaelis-Menten’s simplification rule for enzymatic reactions. I...
متن کاملTranslated chemical reaction networks.
Many biochemical and industrial applications involve complicated networks of simultaneously occurring chemical reactions. Under the assumption of mass action kinetics, the dynamics of these chemical reaction networks are governed by systems of polynomial ordinary differential equations. The steady states of these mass action systems have been analyzed via a variety of techniques, including stoi...
متن کاملMonotone chemical reaction networks
We analyze certain chemical reaction networks and show that every solution converges to some steady state. The reaction kinetics are assumed to be monotone but otherwise arbitrary. When diffusion effects are taken into account, the conclusions remain unchanged. The main tools used in our analysis come from the theory of monotone dynamical systems. We review some of the features of this theory a...
متن کاملConcordant chemical reaction networks.
We describe a large class of chemical reaction networks, those endowed with a subtle structural property called concordance. We show that the class of concordant networks coincides precisely with the class of networks which, when taken with any weakly monotonic kinetics, invariably give rise to kinetic systems that are injective - a quality that, among other things, precludes the possibility of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2013
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-013-9393-6